Evaluation of Length-Lex Set Variables
نویسندگان
چکیده
This paper presents the first experimental evaluation of the length-lex domain for set variables. The implementation is based on bound-consistency algorithms proposed in earlier work and two novel technical contributions: a generic filtering algorithm which automatically pushes ordering constraints into symmetric binary constraints with only a logarithmic overhead and an adaptation of symmetry-breaking constraints from 0/1 matrices to the length-lex ordering. The experimental results indicate that the length-lex representation for set variables is very effective and robust on traditional set-CSPs benchmarks.
منابع مشابه
A Comparison of Lex Bounds for Multiset Variables in Constraint Programming
Set and multiset variables in constraint programming have typically been represented using subset bounds. However, this is a weak representation that neglects potentially useful information about a set such as its cardinality. For set variables, the length-lex (LL) representation successfully provides information about the length (cardinality) and position in the lexicographic ordering. For mul...
متن کاملLength-Lex Bounds Consistency for Knapsack Constraints
Recently, a new domain store for set-variables has been proposed which totally orders all values in the domain of a set-variable based on cardinality and lexicography. Traditionally, knapsack constraints have been studied with respect to the required and possible set domain representation. For this domainstore efficient filtering algorithms achieving relaxed and approximated consistency are kno...
متن کاملLength-Lex Ordering for Set CSPs
Combinatorial design problems arise in many application areas and are naturally modelled in terms of set variables and constraints. Traditionally, the domain of a set variable is specified by two sets (R,E) and denotes all sets containing R and disjoint from E. This representation has inherent difficulties in handling cardinality and lexicographic constraints so important in combinatorial desig...
متن کاملApplication of Lex Mercatoria as Applicable Law in International Commercial Arbitration
In settling disputes regarding international commercial arbitration the parties may instead of choosing the law of one country to choose lex mercatoria or the law of merchants as a applicable law to the disputes. When this choice is possible that applicable choice of law rules recognize such power for the parties. The principle of autonomy is choosing lex mercatoria has been recognized in many ...
متن کاملBound Consistency for Binary Length-Lex Set Constraints
The length-lex representation has been recently proposed for representing sets in Constraint Satisfaction Problems. The length-lex representation directly captures cardinality information, provides a total ordering for sets, and allows bound consistency on unary constraints to be enforced in time Õ(c), where c is the cardinality of the set. However, no algorithms were given to enforce bound con...
متن کامل